A Quadratic Diophantine Equation Involving Generalized Fibonacci Numbers

Diophantine quadruples and Fibonacci numbers

A Diophantine m-tuple is a set of m positive integers with the property that product of any two of its distinct elements is one less then a square. In this survey we describe some problems and results concerning Diophantine m-tuples and their connections with Fibonacci numbers.

Some New Finite Sums Involving Generalized Fibonacci And Lucas Numbers

On Diophantine Quadruples of Fibonacci Numbers

We show that there are only finitely many Diophantine quadruples, that is, sets of four positive integers {a1, a2, a3, a4} such that aiaj +1 is a square for all 1 ≤ i < j ≤ 4, consisting of Fibonacci numbers.

GENERALIZED q - FIBONACCI NUMBERS

We introduce two sets of permutations of {1, 2, . . . , n} whose cardinalities are generalized Fibonacci numbers. Then we introduce the generalized q-Fibonacci polynomials and the generalized q-Fibonacci numbers (of first and second kind) by means of the major index statistic on the introduced sets of permutations.

Restricted Permutations, Fibonacci Numbers, and k-generalized Fibonacci Numbers

In 1985 Simion and Schmidt showed that the number of permutations in Sn which avoid 132, 213, and 123 is equal to the Fibonacci number Fn+1. We use generating function and bijective techniques to give other sets of pattern-avoiding permutations which can be enumerated in terms of Fibonacci or k-generalized Fibonacci numbers.